Least squares support vector machines for fixed-step and fixed-set CDMA power control
نویسندگان
چکیده
Power control is a critical component in CDMA cellular systems. Power control combats the “near-fat” effect by adjusting the transmit power of each mobile. This technique reduces the multiple access interference and if the system capacity is within the set limits the, desired signalto-interference ratios (SIRS) are achieved at all base stations. Research in the power control field covers centralized, distributed, and stochastic power control [1],[2],[3]. In most of the published research however, it is assumed that the uplink channel gain is known, and no limitations are placed on the word-length and update rate of the transmitted power control command. The IS-95 and cdma2000/3G systems have an 800 bps up/down power control command rate; the single bit power control command is thus sent to the mobile station every 1.25 milliseconds [4]. This limits the options with regards to power control systems, but the design reduces the problem to that of generating a fixed-step power control command. Standard power control systems implemented in cellular systems use signa-to-interference ratio (SIR) estimates, hit emor rates (BER), or frame error rates (FER). Many of the published power control algorithms assume that these estimates are available and accurate. The algorithms presented in this paper require only the set of eigenvalues from the sample covariance matrix of the received signal; the signal subspace dimension and power estimates are not required. The machine learning algorithm classifies the set of eigenvalues into a SIR set which then determines the power control command. Both binary and multiclass machine learning algorithms are developed to
منابع مشابه
Least squares support vector machines for direction of arrival estimation with error control and validation
This paper presents a multiclass, multilabel implementation of Least Squares Support Vector Machines (LS-SVM) for direction of arrival (DOA) estimation in a CDMA system. For any estimation or classification system the algorithm’s capabilities and performance must be evaluated. Specifically, for classification algorithms a high confidence level must exist along with a technique to automatically ...
متن کاملIdentification and Adaptive Position and Speed Control of Permanent Magnet DC Motor with Dead Zone Characteristics Based on Support Vector Machines
In this paper a new type of neural networks known as Least Squares Support Vector Machines which gained a huge fame during the recent years for identification of nonlinear systems has been used to identify DC motor with nonlinear dead zone characteristics. The identified system after linearization in each time span, in an online manner provide the model data for Model Predictive Controller of p...
متن کاملLeast Squares Support Vector Machines and Primal Space Estimation
In this paper a methodology for estimation in kernel-induced feature spaces is presented, making a link between the primal-dual formulation of Least Squares Support Vector Machines (LS-SVM) and classical statistical inference techniques in order to perform linear regression in primal space. This is done by computing a finite dimensional approximation of the kernel-induced feature space mapping ...
متن کاملSingle Directional SMO Algorithm for Least Squares Support Vector Machines
Working set selection is a major step in decomposition methods for training least squares support vector machines (LS-SVMs). In this paper, a new technique for the selection of working set in sequential minimal optimization- (SMO-) type decomposition methods is proposed. By the new method, we can select a single direction to achieve the convergence of the optimality condition. A simple asymptot...
متن کاملOptimized fixed-size kernel models for large data sets
A modified active subset selection method based on quadratic Rényi entropy and a fast cross-validation for fixed-size least-squares support vector machines is proposed for classification and regression with optimized tuning process. The kernel bandwidth of the entropy based selection criterion is optimally determined according to the solve-the-equation plug-in method. Also a fast cross-validati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004